Construction of σ-orthogonal Polynomials and Gaussian Quadrature Formulas
نویسندگان
چکیده
Let dα be a measure on R and let σ = (m1,m2, ..., mn), where mk ≥ 1, k = 1, 2, ..., n, are arbitrary real numbers. A polynomial ωn(x) := (x − x1)(x − x2)...(x − xn) with x1 ≤ x2 ≤ ... ≤ xn is said to be the n-th σ-orthogonal polynomial with respect to dα if the vector of zeros (x1, x2, ..., xn) is a solution of the extremal problem ∫
منابع مشابه
Kronrod extensions with multiple nodes of quadrature formulas for Fourier coefficients
We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...
متن کاملNumerical Construction of Gaussian Quadrature Formulas for / (-Log *)• xa-f(x)-dx and / Em(x)-j(x)-dx
Most nonclassical Gaussian quadrature rules are difficult to construct because of the loss of significant digits during the generation of the associated orthogonal polynomials. But, in some particular cases, it is possible to develop stable algorithms. This is true for at least two well-known integrals, namely ¡l-(Loêx)-x°f(x)dx and ¡Ô Em(x)f(x)-dx. A new approach is presented, which makes use ...
متن کاملNumerical Construction of Gaussian Quadrature Formulas for
Most nonclassical Gaussian quadrature rules are difficult to construct because of the loss of significant digits during the generation of the associated orthogonal polynomials. But, in some particular cases, it is possible to develop stable algorithms. This is true for at least two well-known integrals, namely ¡l-(Loêx)-x°f(x)dx and ¡Ô Em(x)f(x)-dx. A new approach is presented, which makes use ...
متن کاملNumerical quadratures and orthogonal polynomials
Orthogonal polynomials of different kinds as the basic tools play very important role in construction and analysis of quadrature formulas of maximal and nearly maximal algebraic degree of exactness. In this survey paper we give an account on some important connections between orthogonal polynomials and Gaussian quadratures, as well as several types of generalized orthogonal polynomials and corr...
متن کاملA Characterization of Positive Quadrature Formulae
A positive quadrature formula with n nodes which is exact for polynomials of degree In — r — 1, 0 < r < « , is based on the zeros of certain quasi-orthogonal polynomials of degree n . We show that the quasi-orthogonal polynomials that lead to the positive quadrature formulae can all be expressed as characteristic polynomials of a symmetric tridiagonal matrix with positive subdiagonal entries. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005